On Approximate Pattern Matching for a Class of Gibbs Random Fields
نویسندگان
چکیده
We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibbsian sources on the lattice Z, d ≥ 2. From this result, we deduce a law of large numbers and a large deviation result for the the waiting time of distorted patterns. Key-words: Gibbs measures, approximate matching, exponential law, lossy data compression, law of large numbers, large deviations.
منابع مشابه
On Approximate Pattern Matching for a Class of Gibbs Random Fields by Jean-rene Chazottes,
We prove an exponential approximation for the law of approximate occurrence of typical patterns for a class of Gibssian sources on the lattice Z d , d ≥ 2. From this result, we deduce a law of large numbers and a large deviation result for the waiting time of distorted patterns. 1. Introduction. In recent years there has been growing interest in a detailed probabilistic analysis of pattern matc...
متن کاملRandomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is the computation of the partition function, which may require an intractable sum. However, in many such models, the mode can be found efficiently even when the partition function is unavailable. Recent work on Perturb-...
متن کاملLearning in Gibbsian Fields: How Accurate and How Fast Can It Be?
ÐGibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronounced by the recent minimax entropy (FRAME) models which use large neighborhoods and hundreds of parameters [22]. In this paper, we present a common framework for learning Gibbs models. We identify two key factors that ...
متن کاملString Matching and its Applications in Diversified Fields
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.[11] String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has ...
متن کاملBayesian Model Choice using Coupled ABC
In Neal (2010), a novel Approximate Bayesian Computation (ABC) algorithm, coupled ABC, was introduced. This paper shows how coupled ABC can be used in an efficient manner for model choice in a Bayesian framework. The methodology is applied to Gibbs random fields and stochastic epidemic models. Furthermore a very efficient simulation procedure for Gibbs random fields with a given sufficient summ...
متن کامل